Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement

نویسنده

  • Matthew G. Parker
چکیده

A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. We identify a subset of these sequences that map to binary indicators for linear and nonlinear Factor Graphs, after application of subspace Walsh-Hadamard Transforms. Finally we investigate the quantum PARl measure of ’Linear Entanglement’ (LE) under any Local Unitary Transform, where optimum LE implies optimum weight hierarchy of an associated linear code.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q+1

The entanglement-assisted stabilizer formalism provides a useful framework for constructing quantum error-correcting codes (QECC), which can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this paper, we construct five classes of entanglement-assisted quantum M...

متن کامل

The Quantum Entanglement of Binary and Bipolar Sequences

Classification of different forms of quantum entanglement is an active area of research, central to development of effective quantum computers, and similar to classification of error-correction codes, where code duality is broadened to equivalence under all ’local’ unitary transforms. We explore links between entanglement, coding theory, and sequence design, by examining multi-spectra of quantu...

متن کامل

Bounds on the decoding complexity of punctured codes on graphs

We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. This is in contrast to all previous constructions of capacity-achieving sequences of ensembles whose complexity grows at least like the log of the...

متن کامل

Entanglement spectrum of topological insulators and superconductors.

We study two a priori unrelated constructions: the spectrum of edge modes in a band topological insulator or superconductor with a physical edge, and the ground state entanglement spectrum in an extended system where an edge is simulated by an entanglement bipartition. We prove an exact relation between the ground state entanglement spectrum of such a system and the spectrum edge modes of the c...

متن کامل

Designing entanglement-assisted quantum low-density parity-check codes

This paper develops a general theory for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum error-correcting codes (EAQECCs) with many desirable properties. These properties include the requirement of only one initial entanglement bit, high error corre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001